MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS
نویسندگان
چکیده
منابع مشابه
Minimum Spanning Tree with Uncertain Random Weights
This paper considers the minimum spanning tree problem with uncertain random weights in an uncertain random network. The concept of uncertain random minimum spanning tree is initiated for minimum spanning tree problem with uncertain random edge weights. A model is presented to formulate a specific minimum spanning tree problem with uncertain random edge weights involving a distance chance distr...
متن کامل4 Minimum Spanning Tree
This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...
متن کاملImage Registration with Minimum Spanning Tree Algorithm
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphrepresentation method for image registration with Rényi entropy as the dissimilarity metric between images. The image matching is performed by minimizing the length of the minimum spanning tree (MST) which spans the graph gen...
متن کاملA Type of Inverse Minimum Spanning Tree Problem with Fuzzy Edge Weights
Classic inverse minimum spanning tree problem is to make the least edge weight modification such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. Although many applications can be formulated into this problem, fuzzy parameters are met in some real-world applications. In this paper, a type of inverse minimum spanning tree problem with fuzzy edge...
متن کاملModels and hybrid algorithms for inverse minimum spanning tree problem with stochastic edge weights∗
An inverse minimum spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the inverse minimum spanning tree problem with stochastic edge weights is investigated. The concept of α-minimum spanning tree is initiated, and subsequently an α-minimum spanning tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1981
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.24.61